Fluid limits for earliest-deadline-first networks

This paper analyzes fluid scale asymptotics of two models generalized Jackson networks employing the earliest deadline first (EDF) policy. One applies ‘soft’ EDF policy, where deadlines are used to determine priority but jobs do not renege, and other implements ‘hard’ EDF, renege when expire, postponed with each migration a new station. The arrival rates, distribution service capacity allowed fluctuate over time at scale. Earlier work on network limits, as tool obtain stability these networks, addressed only soft version moreover did contain full limit result. In this paper, tools that extend notion measure-valued Skorokhod map developed establish for limits both hard models.